The First-Order Syntax of Variadic Functions
نویسندگان
چکیده
منابع مشابه
From Variadic Functions to Variadic Relations A miniKanren Perspective
We present an implementation of miniKanren, an embedding of logic programming in RRS Scheme that comprises three logic operators. We describe these operators, and use them to define plus , a relation that adds two numbers. We then define plus ∗o, which adds zero or more numbers; plus ∗o takes exactly two arguments, the first of which is a list of numbers to be added or a logical variable repres...
متن کاملThe eval Symbol for Axiomatising Variadic Functions
This paper describes (and constitutes the source for!) the proposed list4 OpenMath content dictionary. The main feature in this content dictionary is the eval symbol, which treats a list of values as the list of children of an application element. This may, among other things, be employed to state properties of variadic functions. 1 Background and motivation OpenMath is a formal language for (p...
متن کاملNatural Language Syntax and First-Order Inference
We have argued elsewhere that rst order inference can be made more eecient by using non-standard syntax for rst order logic. In this paper we deene a syntax for rst order logic based on the structure of natural language under Montague semantics. We show that, for a certain fairly expressive fragment of this language, satissability is polynomial time decidable. The polynomial time decision proce...
متن کاملFirst Order Languages: Further Syntax and Semantics1
Third of a series of articles laying down the bases for classical first order model theory. Interpretation of a language in a universe set. Evaluation of a term in a universe. Truth evaluation of an atomic formula. Reassigning the value of a symbol in a given interpretation. Syntax and semantics of a non atomic formula are then defined concurrently (this point is explained in [16], 4.2.1). As a...
متن کاملNatural Language Syntax and First Order In
We have argued elsewhere that rst order inference can be made more eecient by using non-standard syntax for rst order logic. In this paper we deene a syntax for rst order logic based on the structure of natural language under Montague semantics. We show that, for a certain fairly expressive fragment of this language, satissability is polynomial time decidable. The polynomial time decision proce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2013
ISSN: 0029-4527
DOI: 10.1215/00294527-1731380